Multi-Domain Generalized Graph Meta Learning

نویسندگان

چکیده

Graph meta learning aims to learn historical knowledge from training graph neural networks (GNNs) models and adapt it downstream tasks in a target graph, which has drawn increasing attention due its ability of transfer fast adaptation. While existing approaches assume the are same domain but lack solution for multi-domain In this paper, we address generalized problem, is challenging non-Euclidean data, inequivalent feature spaces, heterogeneous distributions. To end, propose novel called MD-Gram generalization. It introduces an empirical generalization method that uses vectors form unified expression data. Then proposes graphs transformation approach transform multiple source-domain with spaces into common domain, where conducted knowledge. further adopts domain-specific GNN enhancement customized model achieve adaptation unseen domain. Extensive experiments based on four real-world datasets show proposed significantly outperforms state-of-the-art tasks.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Learning Graph Quantization

This contribution extends generalized LVQ, generalized relevance LVQ, and robust soft LVQ to the graph domain. The proposed approaches are based on the basic learning graph quantization (lgq) algorithm using the orbifold framework. Experiments on three data sets show that the proposed approaches outperform lgq and lgq2.1.

متن کامل

Automatic Domain Partitioning for Multi-Domain Learning

Multi-Domain learning (MDL) assumes that the domain labels in the dataset are known. However, when there are multiple metadata attributes available, it is not always straightforward to select a single best attribute for domain partition, and it is possible that combining more than one metadata attributes (including continuous attributes) can lead to better MDL performance. In this work, we prop...

متن کامل

Graph and Subspace Learning for Domain Adaptation

Graph and Subspace Learning for Domain Adaptation by Le Shu Doctor of Philosophy in Computer and Information Sciences Temple University in Philadelphia, October, 2015 Researcher Advisor: Longin Jan Latecki In many practical problems, given that the instances in the training and test may be drawn from different distributions, traditional supervised learning can not achieve good performance on th...

متن کامل

Metric Learning for Graph-Based Domain Adaptation

In many domain adaption formulations, it is assumed to have large amount of unlabeled data from the domain of interest (target domain), some portion of it may be labeled, and large amount of labeled data from other domains, also known as source domain(s). Motivated by the fact that labeled data is hard to obtain in any domain, we design algorithms for the settings in which there exists large am...

متن کامل

Cross-Graph Learning of Multi-Relational Associations

Cross-graph Relational Learning (CGRL) refers to the problem of predicting the strengths or labels of multi-relational tuples of heterogeneous object types, through the joint inference over multiple graphs which specify the internal connections among each type of objects. CGRL is an open challenge in machine learning due to the daunting number of all possible tuples to deal with when the number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i4.25569